Application of the fast marching method for outdoor motion planning in robotics
نویسندگان
چکیده
In this paper, a new path planning method for robots used in outdoors environments is presented. The proposed method applies Fast Marching to a 3D surface represented with a triangular mesh to calculate a smooth trajectory from one point to another. The method uses a triangular mesh instead of a square mesh since this kind of grid adapts better to 3D surfaces. The novelty of this approach is that, before running the algorithm, the method calculates a weight matrix W based on the information extracted from the 3D surface characteristics. In the presented experiments those features are the height, the spherical variance, and the gradient of the surface. This matrix can be viewed as a difficulty map situated over the 3D surface, and it is used to limit the speed propagation of the Fast Marching wave in order to find the best path depending on the task requirements, e.g., the less energy consumption path, the fastest path, the most plain terrain. The algorithm also gives the velocity for the robot which is based on the wave front propagation speed. The results presented in this paper show how varying this W matrix, the paths obtained are different.
منابع مشابه
Robot formation motion planning using Fast Marching
This paper presents the application of the Voronoi Fast Marching method to Path Planning of Mobile Formation Robots. The Voronoi Fast Marching method uses the propagation of a wave (Fast Marching) operating on the world model to determine a motion plan over a viscosity map (similar to the refraction index in optics) extracted from the updated map model. The computational efficiency of the metho...
متن کاملFast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions
In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT∗). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art coun...
متن کاملPerformance analysis of fast marching-based motion planning for autonomous mobile robots in ITER scenarios
Operations of transportation in cluttered environments require robust motion planning algorithms. Specially with large and heavy vehicles under hazardous operations of maintenance, such as in the ITER, an international nuclear fusion research project. The load transportation inside the ITER facilities require smooth and optimized paths with safety margin of 30 cm. The transportation is accompli...
متن کاملAA290: Precomputed Lattices and Paths for Robotic Motion Planning Using Fast Marching Trees
Robotic motion planning problems often require solutions in real-time, however with kinodynamic planning or problems with uncertainties in the environment, this may be very difficult if not impossible with an all on-line algorithm. By precomputing information or formatting the configuration space in specific ways, it may be possible to plan the remaining necessary information on-line, even for ...
متن کاملFast Marching Trees
In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT∗ ). The algorithm is specifically aimed at solving complex motion planning problems in highdimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art coun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Robotics and Autonomous Systems
دوره 61 شماره
صفحات -
تاریخ انتشار 2013